package com.person.leetcode.editor.cn;

import java.util.Arrays;

/**
  * 1089.复写零
  * 2022-06-17 15:28:44
**/
public class Sequence_1089_DuplicateZeros {
    public static void main(String[] args) {
        Solution solution = new Sequence_1089_DuplicateZeros().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public void duplicateZeros(int[] arr) {
        int move = 0;
        int t = 0;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == 0){


                move ++;
            }
        }
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}